On a problem of Rivlin in Lp (1 < p < ∞) approximation
نویسندگان
چکیده
منابع مشابه
A 1.75 LP approximation for the Tree Augmentation Problem
In the Tree Augmentation Problem (TAP) the goal is to augment a tree T by a minimum size edge set F from a given edge set E such that T ∪F is 2-edge-connected. The best approximation ratio known for TAP is 1.5. In the more general Weighted TAP problem, F should be of minimum weight. Weighted TAP admits several 2-approximation algorithms w.r.t. to the standard cut LP-relaxation, but for all of t...
متن کاملA NOTE ON THE SPACES Lp FOR 0 < p < 1
It is shown that there is no Hausdorff vector topology p on the space Lp (where 0 < p < 1) such that the unit ball of Lp is relatively compact for the topology p. It is well known that the space L1 (0, 1) is not a dual Banach space; this follows from the Krein-Milman theorem. It is not even isomorphic to a dual space, by a result due to Gelfand [2] (see Bessaga and Pelczyn'ski [1] and Namioka [...
متن کاملConvex Polynomial and Spline Approximation in Lp , 0 < p <
We prove that a convex function f 6 L p [ -1 , 1], 0 < p < cx~, can be approximated by convex polynomials with an error not exceeding Cw~ (f, 1/n)p where w~(f, .) is the Ditzian-Totik modulus of smoothness of order three of f . We are thus filling the gap between previously known estimates involving og~(f, I/n)p, and the impossibility of having such estimates involving ~o4. We also give similar...
متن کاملThe Robustness of Lp, p <1
In robust statistics, the breakdown point of an estimator is the percentage of outliers with which an estimator still generates reliable estimation. The upper bound of breakdown point is 50%, which means it is not possible to generate reliable estimation with more than half outliers [1-2] . In this paper, it is shown that for majority of experiences, when the outliers exceed 50%, but if they ar...
متن کاملAn LP 7/4-approximation for the Tree Augmentation Problem
In the Tree Augmentation Problem (TAP) the goal is to augment a tree T by a minimum size edge set F from a given edge set E such that T ∪ F is 2-edge-connected. The best known approximation ratio for the problem is 1.5 [5, 12]. Several paper analysed integrality gaps of LP and SDP relaxations for the problem. In [13] is given a simple LP with gap 1.5 for the case when every edge in E connects t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1984
ISSN: 0021-9045
DOI: 10.1016/0021-9045(84)90065-0